翻訳と辞書 |
Goal node (computer science) : ウィキペディア英語版 | Goal node (computer science) In computer science, a goal node is a node in a graph that meets defined criteria for success or termination. Heuristical artificial intelligence algorithms, like A * and B *, attempt to reach such nodes in optimal time by defining the distance to the goal node. When the goal node is reached, A * defines the distance to the goal node as 0 and all other nodes' distances as positive values. ==References==
*N.J. Nilsson ''Principles of Artificial Intelligence'' (1982 Birkhäuser) p. 63
抄文引用元・出典: フリー百科事典『 ウィキペディア(Wikipedia)』 ■ウィキペディアで「Goal node (computer science)」の詳細全文を読む
スポンサード リンク
翻訳と辞書 : 翻訳のためのインターネットリソース |
Copyright(C) kotoba.ne.jp 1997-2016. All Rights Reserved.
|
|